uri 1318 solution in cpp
by ujjal roy
#include<bits/stdc++.h>
using namespace std;
main()
{
int n,m;
while(cin>>n>>m)
{
if(n==0&&m==0) break;
int i,c=0;
vector<int> v(m);
map<int ,int> mp;
for(i=0;i<m;i++)
{
cin>>v[i];
mp[v[i]]++;
}
sort(v.begin(),v.end());
int u=unique(v.begin(),v.end())-v.begin();
for(i=0;i<u;i++)
{
if(mp[v[i]]>1) c++;
}
cout<<c<<endl;
}
return 0;
}
0 Comments